The Locating-chromatic Number of Disconnected Graphs
نویسندگان
چکیده
The paper generalizes the notion of locating-chromatic number of a graph such that it can be applied to disconnected graphs as well. In this sense, not all the graphs will have finite locating-chromatic numbers. We derive conditions under which a graph has a finite locating-chromatic number. In particular, we determine the locatingchromatic number of a uniform linear forest, namely a disjoint union of some paths with the same length. Des Welyyanti et al. 170
منابع مشابه
The locating-chromatic number for Halin graphs
Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...
متن کاملThe locating chromatic number of the join of graphs
Let $f$ be a proper $k$-coloring of a connected graph $G$ and $Pi=(V_1,V_2,ldots,V_k)$ be an ordered partition of $V(G)$ into the resulting color classes. For a vertex $v$ of $G$, the color code of $v$ with respect to $Pi$ is defined to be the ordered $k$-tuple $c_{{}_Pi}(v)=(d(v,V_1),d(v,V_2),ldots,d(v,V_k))$, where $d(v,V_i)=min{d(v,x):~xin V_i}, 1leq ileq k$. If distinct...
متن کاملThe distinguishing chromatic number of bipartite graphs of girth at least six
The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling with $d$ labels that is preserved only by a trivial automorphism. The distinguishing chromatic number $chi_{D}(G)$ of $G$ is defined similarly, where, in addition, $f$ is assumed to be a proper labeling. We prove that if $G$ is a bipartite graph of girth at least six with the maximum ...
متن کاملCharacterizing all trees with locating-chromatic number 3
Let c be a proper k-coloring of a connected graph G. Let Π = {S1, S2, . . . , Sk} be the induced partition of V (G) by c, where Si is the partition class having all vertices with color i. The color code cΠ(v) of vertex v is the ordered k-tuple (d(v, S1), d(v, S2), . . . , d(v, Sk)), where d(v, Si) = min{d(v, x)|x ∈ Si}, for 1 ≤ i ≤ k. If all vertices of G have distinct color codes, then c is ca...
متن کاملThe Locating Chromatic Number of the Join of Graphs
Let f be a proper k-coloring of a connected graph G and Π = (V1, V2, . . . , Vk) be an ordered partition of V (G) into the resulting color classes. For a vertex v of G, the color code of v with respect to Π is defined to be the ordered k-tuple cΠ(v) = (d(v, V1), d(v, V2), . . . , d(v, Vk)), where d(v, Vi) = min{d(v, x) : x ∈ Vi}, 1 ≤ i ≤ k. If distinct vertices have distinct color codes, then f...
متن کامل